On finite graphs that are self-complementary and vertex transitive
نویسنده
چکیده
Self-complementary graphs have been extensively investigated and effectively used in the study of Ramsey numbers. It is well-known and easily proved that there exist regular self-complementary graphs of order n if and only if n == 1 (mod 4). So it is natural to ask whether a similar result for self-complementary vertex-transitive graphs exists. More precisely, for which positive integers n do there exist self-complementary vertex-transitive graphs of order n? Recently, several long-standing open problems concerning this question have been solved, but the general question is still open. In this article we give a brief survey in this area and introduce several new problems.
منابع مشابه
Self-Complementary Vertex-Transitive Graphs
A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...
متن کاملOn Sylow Subgraphs of Vertex-transitive Self-complementary Graphs
One of the basic facts of group theory is that each finite group contains a Sylow p-subgroup for each prime p which divides the order of the group. In this note we show that each vertex-transitive selfcomplementary graph has an analogous property. As a consequence of this fact, we obtain that each prime divisor p of the order of a vertex-transitive self-complementary graph satisfies the congrue...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملVertex-transitive self-complementary uniform hypergraphs
In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive selfcomplementary k-uniform hypergraph of order n, where k = 2 or k = 2 + 1 and n ≡ 1 (mod 2), then the highest power of any prime dividing n must be congruent to 1 modulo 2. We show that this necessary condition is also sufficient in ...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 18 شماره
صفحات -
تاریخ انتشار 1998